Convergence properties of Gram-Schmidt and SMI adaptive algorithms
نویسندگان
چکیده
منابع مشابه
Optimal Gram-schmidt Type Algorithms
A Gram-Schmidt type algorithm is given for finite d-dimensional reflexive forms over division rings. The algorithm uses d/3 + O(d) ring operations. Next, that algorithm is adapted in two new directions. First a sequential algorithm is given whose complexity matches the complexity of matrix multiplication. Second, a parallel NC algorithm is given with similar complexity.
متن کاملSelective Gram-Schmidt orthonormalization for conic cutting surface algorithms
It is not straightforward to find a new feasible solution when several conic constraints are added to a conic optimization problem. Examples of conic constraints include semidefinite constraints and second order cone constraints. In this paper, a method to slightly modify the constraints is proposed. Because of this modification, a simple procedure to generate strictly feasible points in both t...
متن کاملSVP , Gram - Schmidt , LLL
Last time we defined the minimum distance λ1(L) of a lattice L, and showed that it is upper bounded by √ n · det(L)1/n (Minkowski’s theorem), but this bound is often very loose. Some natural computational questions are: given a lattice (specified by some arbitrary basis), can we compute its minimum distance? Can we find a vector that achieves this distance? Can we find good approximations to th...
متن کاملRobust Selective Gram-schmidt Reorthogonalization
A new criterion for selective reorthogonalization in the Gram-Schmidt procedure is given. We establish its comportment in presence of rounding errors when the criterion is used with modified Gram-Schmidt algorithm and show counter-example matrices which prove that standard criteria are not always valid. Experimentally, our criterion is fine also for the classical Gram-Schmidt algorithm with reo...
متن کاملExperiments on Gram-schmidt Orthogonalization
(3) In addition to solutions for | k | ^ 9999, we have solutions, for y ^ 104 and | k | g 99999; there are 1221 for positive k and 799 for negative k. The vast majority of solutions are with y < 100 and Table 2 gives the number of solutions for various ranges of y. The fact that the number of solutions is a rapidly decreasing function of y suggests that for at least some k the solution set may ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Aerospace and Electronic Systems
سال: 1990
ISSN: 0018-9251
DOI: 10.1109/7.53412